On Descriptive Complexity, Language Complexity, and GB

We introduce L2K,P, a monadic second-order language for reasoning about trees which characterizes the strongly Context-Free Languages in the sense that a set of finite trees is definable in L2K,P, if it is (modulo a projection) a Local Set-the set of derivation trees generated by a CFG. This provides a flexible approach to establishing language-theoretic complexity results for formalisms that are based on systems of wellformedness constraints on trees. We demonstrate this technique by sketching two such results for Government and Binding Theory. First, we show that free-indexation, the mechanism assumed to mediate a variety of agreement and binding relationships in GB, is not definable in L2K,P, and therefore not enforceable by CFGs. Second, we show how, in spite of this limitation, a reasonably complete GB account of English can be defined in L2K,P. Consequently, the language licensed by that account is strongly context-free. We illustrate some of the issues involved in establishing this result by looking at the definition, L2K,P, of chains. The limitations of this definition provide some insight into the types of natural linguistic principles that correspond to higher levels of language complexity. We close with some speculation on the possible significance of these results for generative linguistics. Comments University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-95-14. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/ircs_reports/128